Weak sharp minima in multiobjective optimization
نویسندگان
چکیده
We extend some necessary and sufficient conditions for strict local Pareto minima of orderm obtained by Jiménez (2002) to the case of weak ψ-sharp local Pareto minima, i.e., to the case when the local solution is not necessarily unique.
منابع مشابه
Weak Sharp Minima on Riemannian Manifolds
This is the first paper dealing with the study of weak sharp minima for constrained optimization problems on Riemannian manifolds, which are important in many applications. We consider the notions of local weak sharp minima, boundedly weak sharp minima, and global weak sharp minima for such problems and establish their complete characterizations in the case of convex problems on finite-dimensio...
متن کاملEquivalent properties of global weak sharp minima with applications
* Correspondence: [email protected] Department of Mathematics, School of Science, Shandong University of Technology, Zibo, 255049, China Full list of author information is available at the end of the article Abstract In this paper, we study the concept of weak sharp minima using two different approaches. One is transforming weak sharp minima to an optimization problem; another is using conju...
متن کاملWeak Sharp Minima in Multicriteria Linear Programming
In this short note, we study the existence of weak sharp minima in multicriteria linear programming. It is shown that weak sharp minimality holds for certain residual functions and gap functions.
متن کاملThe Global Weak Sharp Minima with Explicit Exponents in Polynomial Vector Optimization Problems
In this paper we discuss the global weak sharp minima property for vector optimization problems with polynomial data. Exploiting the imposed polynomial structure together with tools of variational analysis and a quantitative version of Lojasiewicz’s gradient inequality due to D’Acunto and Kurdyka, we establish the Hölder type global weak sharp minima with explicitly calculated exponents.
متن کاملWeak Sharp Minima with Explicit Exponents in Vector Optimization Problems with Polynomial Data
In this paper we discuss weak sharp minima for vector optimization problems with polynomial data. Exploiting the imposed polynomial structure together with powerful tools of variational analysis and semialgebraic geometry and under some slight assumptions, we establish (Hölder type) bounded and global weak sharp minima with explicitly calculated exponents.
متن کامل